Progressively Decomposing Graph Matching
نویسندگان
چکیده
منابع مشابه
Decomposing Pattern Matching Circuit
This paper presents a new cost-efficient realization scheme of pattern matching circuits in FPGA structures with embedded memory blocks (EMB). The general idea behind the proposed method is to implement combinational circuits using a net of finite state machines (FSM) instead. The application of functional decomposition method reduces the utilization of resources by implementing FSMs using both...
متن کاملDecomposing a planar graph with girth 9 into a forest and a matching
W. He et al. showed that a planar graph of girth 11 can be decomposed into a forest and a matching. D. Kleitman et al. proved the same statement for planar graphs of girth 10. We further improve the bound on girth to 9. c © 2007 Elsevier Ltd. All rights reserved.
متن کاملDecomposing a Graph Into Expanding Subgraphs
A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that any graph is close to being the disjoint union of expanders. Our goal in this paper is to show that in several of the instantiations of the above approach, the quantitative bounds that were obtained are essentially best possible. Three exampl...
متن کاملCyclically decomposing the complete graph into cycles
Let m1; m2; : : : ; mk be positive integers not less than 3 and let n= ∑k i=1 mi. Then, it is proved that the complete graph of order 2n+ 1 can be cyclically decomposed into k(2n+ 1) cycles such that, for each i= 1; 2; : : : ; k, the cycle of length mi occurs exactly 2n+ 1 times. c © 2003 Elsevier B.V. All rights reserved.
متن کاملON THE MATCHING NUMBER OF AN UNCERTAIN GRAPH
Uncertain graphs are employed to describe graph models with indeterministicinformation that produced by human beings. This paper aims to study themaximum matching problem in uncertain graphs.The number of edges of a maximum matching in a graph is called matching numberof the graph. Due to the existence of uncertain edges, the matching number of an uncertain graph is essentially an uncertain var...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2908925